Similarity Search In Multimedia Databases Habilitation
نویسنده
چکیده
The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce two dynamic techniques of building the M-tree. The first one incorporates a multi-way object insertion while the second one exploits the generalized slim-down algorithm. Usage of these techniques or even combination of them significantly increases the querying performance of the M-tree. We also present comparative experimental results on large datasets showing that the new techniques outperform by far even the static bulk loading algorithm.
منابع مشابه
Distributed similarity search algorithm in distributed heterogeneous multimedia databases
The collection fusion problem in multimedia databases is concerned with the merging of results retrieved by content based retrieval from distributed heterogeneous multimedia databases in order to find the most similar objects to a query object. We propose distributed similarity search algorithms, two heuristic algorithms and an algorithm using the linear regression, to solve this problem. To ou...
متن کاملSimilarity Search in Multimedia Databases
" What is understood need not be discussed " Loren Adams
متن کاملAnalytical Classification of Multimedia Index Structures by Using a Partitioning Method-Based Framework
Due to the advances in hardware technology and increase in production of multimedia data in many applications, during the last decades, multimedia databases have become increasingly important. Contentbased multimedia retrieval is one of an important research area in the field of multimedia databases. Lots of research on this field has led to proposition of different kinds of index structures to...
متن کاملSearch in Multimedia Databases Using Similarity Distance
With the emergence of multimedia databases, exact keyword search performed in traditional databases is not applicable due to the complex semantic nature of multimedia data. In this paper, Content Based Image Retrieval approach was introduced to solve this problem by providing metadata for multimedia databases based on their actual contents (features) rather than raw keywords description. The se...
متن کاملAn efficient nearest neighbor search in high-dimensional data spaces
Similarity search in multimedia databases requires an efficient support of nearest neighbor search on a large set of high-dimensional points. A technique applied for similarity search in multimedia databases is to transform important properties of the multimedia objects into points of a high-dimensional feature space. The feature space is usually indexed using a multidimensional index structure...
متن کامل